Pattern Avoidance and Young Tableaux
نویسندگان
چکیده
منابع مشابه
Pattern Avoidance and Young Tableaux
Motivated by [13, Theorem 4.1], this paper extends Lewis’s bijection to a bijection between a more general class L(n, k, I) of permutations and the set of standard Young tableaux of shape 〈(k + 1)n〉, so the cardinality |L(n, k, I)| = f 〈(k+1)n〉, is independent of the choice of I ⊆ [n]. As a consequence, we obtain some new combinatorial realizations and identities on Catalan numbers. In the end,...
متن کاملBeyond Alternating Permutations: Pattern Avoidance in Young Diagrams and Tableaux
We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West’s notion of shape-Wilf equivalence to apply to alternating permutations and so generalize results of Backelin-West-Xin and Ouchterlony to alternating permutations. Second, we study pattern a...
متن کاملPattern avoidance and RSK-like algorithms for alternating permutations and Young tableaux
We define a class Ln,k of permutations that generalizes alternating (up-down) permutations. We then give bijective proofs of certain pattern-avoidance results for this class. The bijections employed include are a modified form of the RSK insertion algorithm and a different bijection with RSK-like properties. As a special case of our results, we give two bijections between the set A2n(1234) of a...
متن کاملPattern avoidance in alternating permutations and tableaux ( extended abstract )
We give bijective proofs of pattern-avoidance results for a class of permutations generalizing alternating permutations. The bijections employed include a modified form of the RSK insertion algorithm and recursive bijections based on generating trees. As special cases, we show that the sets A2n(1234) and A2n(2143) are in bijection with standard Young tableaux of shape 〈3〉. Alternating permutati...
متن کاملYoung tableaux
This paper gives a qualitative description how Young tableaux can be used to perform a Clebsch-Gordan decomposition of tensor products in SU(3) and how this can be generalized to SU(N).
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2017
ISSN: 1077-8926
DOI: 10.37236/6427